Approximating an interval scheduling problemSPIEKSMA, F. C. R.Lecture notes in computer science. 1998, pp 169-180, issn 0302-9743, isbn 3-540-64736-8Conference Paper

Approximations of independent sets in graphsHALLDORSSON, M. M.Lecture notes in computer science. 1998, pp 1-13, issn 0302-9743, isbn 3-540-64736-8Conference Paper

On the hardness of approximating spannersKORTSARZ, G.Lecture notes in computer science. 1998, pp 135-146, issn 0302-9743, isbn 3-540-64736-8Conference Paper

Finding dense subgraphs with semidefinite programmingSRIVASTAV, A; WOLF, K.Lecture notes in computer science. 1998, pp 181-191, issn 0302-9743, isbn 3-540-64736-8Conference Paper

A new fully polynomial approximation scheme for the knapsack problemKELLERER, H; PFERSCHY, U.Lecture notes in computer science. 1998, pp 123-134, issn 0302-9743, isbn 3-540-64736-8Conference Paper

Approximating circular arc colouring and bandwidth allocation in all-optical ring networksKUMAR, V.Lecture notes in computer science. 1998, pp 147-158, issn 0302-9743, isbn 3-540-64736-8Conference Paper

Approximating maximum independent set in k-clique-free graphsSCHIERMEYER, I.Lecture notes in computer science. 1998, pp 159-168, issn 0302-9743, isbn 3-540-64736-8Conference Paper

Best possible approximation algorithm for MAX SAT with cardinality constraintSVIRIDENKO, M. I.Lecture notes in computer science. 1998, pp 193-199, issn 0302-9743, isbn 3-540-64736-8Conference Paper

Using linear programming in the design and analysis of approximation algorithms : Two illustrative problemsSHMOYS, D. B.Lecture notes in computer science. 1998, pp 15-32, issn 0302-9743, isbn 3-540-64736-8Conference Paper

The t- vertex cover problem : Extending the half integrality framework with budget constraintsHOCHBAUM, D. S.Lecture notes in computer science. 1998, pp 111-122, issn 0302-9743, isbn 3-540-64736-8Conference Paper